Convergence of the multigrid V-cycle algorithm for second-order boundary value problems without full elliptic regularity
نویسنده
چکیده
The multigrid V -cycle algorithm using the Richardson relaxation scheme as the smoother is studied in this paper. For second-order elliptic boundary value problems, the contraction number of the V -cycle algorithm is shown to improve uniformly with the increase of the number of smoothing steps, without assuming full elliptic regularity. As a consequence, the V -cycle convergence result of Braess and Hackbusch is generalized to problems without full elliptic regularity.
منابع مشابه
Convergence of nonconforming multigrid methods without full elliptic regularity
We consider nonconforming multigrid methods for symmetric positive definite second and fourth order elliptic boundary value problems which do not have full elliptic regularity. We prove that there is a bound (< 1) for the contraction number of the W -cycle algorithm which is independent of mesh level, provided that the number of smoothing steps is sufficiently large. We also show that the symme...
متن کاملNew Nonlinear Multigrid Analysis
SUMMARY The nonlinear multigrid is an eecient algorithm for solving the system of nonlinear equations arising from the numerical discretization of nonlinear elliptic boundary problems 7],,9]. In this paper, we present a new nonlinear multigrid analysis as an extension of the linear multigrid theory presented by Bramble, et al. in 5], 6], and 17]. In particular, we prove the convergence of the n...
متن کاملAnalysis of V - Cycle Multigrid
We describe and analyze certain V-cycle multigrid algorithms with forms deened by numerical quadrature applied to the approximation of symmetric second order elliptic boundary value problems. This approach can be used for the eecient solution of nite element systems resulting from numerical quadrature as well as systems arising from nite diierence discretizations. The results are based on a reg...
متن کاملConvergence of nonconforming V-cycle and F-cycle multigrid algorithms for second order elliptic boundary value problems
The convergence of V -cycle and F -cycle multigrid algorithms with a sufficiently large number of smoothing steps is established for nonconforming finite element methods for second order elliptic boundary value problems.
متن کاملThe Analysis of Multigrid Algorithms for Nonsymmetric and Indefinite Elliptic Problems*
We prove some new estimates for the convergence of multigrid algorithms applied to nonsymmetric and indefinite elliptic boundary value problems. We provide results for the so-called 'symmetric' multigrid schemes. We show that for the variable 2^-cycle and the ^-cycle schemes, multigrid algorithms with any amount of smoothing on the finest grid converge at a rate that is independent of the numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Comput.
دوره 71 شماره
صفحات -
تاریخ انتشار 2002